Search results for "Unitary matrix"

showing 6 items of 6 documents

Analytic high-order Douglas–Kroll–Hess electric field gradients

2007

In this work we present a comprehensive study of analytical electric field gradients in hydrogen halides calculated within the high-order Douglas-Kroll-Hess (DKH) scalar-relativistic approach taking picture-change effects analytically into account. We demonstrate the technical feasibility and reliability of a high-order DKH unitary transformation for the property integrals. The convergence behavior of the DKH property expansion is discussed close to the basis set limit and conditions ensuring picture-change-corrected results are determined. Numerical results are presented, which show that the DKH property expansion converges rapidly toward the reference values provided by four-component met…

Classical mechanicsChemistryOperator (physics)Convergence (routing)General Physics and AstronomyApplied mathematicsUnitary matrixLimit (mathematics)Perturbation theory (quantum mechanics)Physical and Theoretical ChemistryUnitary transformationParametrizationBasis set
researchProduct

Unitary Space–Time Constellation Design Based on the Chernoff Bound of the Pairwise Error Probability

2008

Unitary space-time constellation design is considered for noncoherent multiple-antenna communications, where neither the transmitter nor the receiver knows the fading coefficients of the channel. By employing the Clarke's subdifferential theorem of the sum of the kappa largest singular values of a unitary matrix, we present a numerical optimization procedure for finding unitary space-time signal constellations of any dimension. The Chernoff bound of the pairwise error probability is used directly as a design criterion. The constellations are found by performing gradient descent search on a family ldquosurrogaterdquo functions that converge to the maximum pairwise error probability. The comp…

Constellation diagramUnitary matrixLibrary and Information SciencesComputer Science ApplicationsCombinatoricsChannel capacityChernoff boundGradient descentAlgorithmRandom variableDecoding methodsPairwise error probabilityComputer Science::Information TheoryInformation SystemsMathematicsIEEE Transactions on Information Theory
researchProduct

Unitary Groups Acting on Grassmannians Associated with a Quadratic Extension of Fields

2006

Let (V, H) be an anisotropic Hermitian space of finite dimension over the algebraic closure of a real closed field K. We determine the orbits of the group of isometries of (V, H) in the set of K-subspaces of V . Throughout the paper K denotes a real closed field and K its algebraic closure. Then it is well known (see, for example, [4, Chapter 2], [23]; see also [8]) that K = K(i) with i = √−1. Also we let (V,H) be an anisotropic Hermitian space (with respect to the involution underlying the quadratic field extension K/K) of finite dimension n over K. In this context we consider the natural action of the unitary group U = U(V,H) of isometries of (V,H) on the set Xd of all ddimensional K-subs…

Discrete mathematicsClassical groupPure mathematicsDouble cosetProjective unitary groupGeneral Mathematics15A21Unitary matrixSettore MAT/04 - Matematiche ComplementariAlgebraic closure11E39Unitary group51N30Quadratic fieldGeometry of classical groups Canonical forms reductions classificationSpecial unitary groupMathematicsRocky Mountain Journal of Mathematics
researchProduct

Quantum search of spatial regions

2003

Can Grover's algorithm speed up search of a physical region - for example a 2-D grid of size sqrt(n) by sqrt(n)? The problem is that sqrt(n) time seems to be needed for each query, just to move amplitude across the grid. Here we show that this problem can be surmounted, refuting a claim to the contrary by Benioff. In particular, we show how to search a d-dimensional hypercube in time O(sqrt n) for d at least 3, or O((sqrt n)(log n)^(3/2)) for d=2. More generally, we introduce a model of quantum query complexity on graphs, motivated by fundamental physical limits on information storage, particularly the holographic principle from black hole thermodynamics. Our results in this model include a…

Holographic principleDiscrete mathematicsQuantum PhysicsComputational complexity theoryFOS: Physical sciencesComputer Science::Software EngineeringGraph theoryGeneral Relativity and Quantum Cosmology (gr-qc)Unitary matrixUpper and lower boundsGeneral Relativity and Quantum CosmologyCombinatoricsHypercubeQuantum Physics (quant-ph)Black hole thermodynamicsQuantum computerMathematics44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
researchProduct

Invariants and flavour in the general Two Higgs Doublet Model

2012

The flavour structure of the general Two Higgs Doublet Model (2HDM) is analysed and a detailed study of the parameter space is presented, showing that flavour mixing in the 2HDM can be parametrized by various unitary matrices which arise from the misalignment in flavour space between pairs of various Hermitian flavour matrices which can be constructed within the model. This is entirely analogous to the generation of the CKM matrix in the Standard Model (SM). We construct weak basis invariants which can give insight into the physical implications of any flavour model, written in an arbitrary weak basis (WB) in the context of 2HDM. We apply this technique to two special cases, models with MFV…

PhysicsNuclear and High Energy PhysicsParticle physicsfísica010308 nuclear & particles physicsCabibbo–Kobayashi–Maskawa matrixHigh Energy Physics::PhenomenologyFlavourFOS: Physical sciencesUnitary matrixCP-violationParameter space01 natural sciencesHermitian matrixQuark mass matricesBaryogenesisHigh Energy Physics - PhenomenologyStandard Model (mathematical formulation)Two-Higgs-doublet modelHigh Energy Physics - Phenomenology (hep-ph)0103 physical sciences010306 general physicsParticle Physics - Phenomenology
researchProduct

Clarkson-McCarthy inequalities with unitary and isometry orbits

2020

Abstract A refinement of a trace inequality of McCarthy establishing the uniform convexity of the Schatten p-classes for p > 2 is proved: if A , B are two n-by-n matrices, then there exists some pair of n-by-n unitary matrices U , V such that U | A + B 2 | p U ⁎ + V | A − B 2 | p V ⁎ ≤ | A | p + | B | p 2 . A similar statement holds for compact Hilbert space operators. Another improvement of McCarthy's inequality is given via the new operator parallelogramm law, | A + B | 2 ⊕ | A − B | 2 = U 0 ( | A | 2 + | B | 2 ) U 0 ⁎ + V 0 ( | A | 2 + | B | 2 ) V 0 ⁎ for some pair of 2n-by-n isometry matrices U 0 , V 0 .

Trace (linear algebra)010103 numerical & computational mathematics01 natural sciencesUnitary stateConvexityCombinatoricssymbols.namesakeOperator (computer programming)FOS: MathematicsDiscrete Mathematics and Combinatorics0101 mathematicsMathematicsMathematics::Functional AnalysisNumerical AnalysisAlgebra and Number TheoryMathematics::Operator Algebras010102 general mathematicsHilbert spaceUnitary matrixMathematics::Spectral TheoryFunctional Analysis (math.FA)Mathematics - Functional AnalysisIsometrysymbolsComputer Science::Programming LanguagesGeometry and TopologyLinear Algebra and its Applications
researchProduct